翻訳と辞書 Words near each other ・ Resorts World Bhd ・ Resorts World Bimini ・ Resorts World Las Vegas ・ Resorts World Manila ・ Resorts World Manila Masters ・ Resorts World Miami ・ Resorts World Sentosa ・ ReSound ・ Resound ・ Resound (album) ・ Resound the Horn ・ Resource ・ Resource (band) ・ Resource (biology) ・ Resolution independence ・ Resolution inference ・ Resolution Island ・ Resolution Island (New Zealand) ・ Resolution Island (Nunavut) ・ Resolution of Sarajevo Muslims ・ Resolution of singularities ・ Resolution of the Comintern on the Macedonian Question ・ Resolution of the Dreyfus Affair ・ Resolution on Taiwan's Future ・ Resolution Party ・ Resolution plc ・ Resolution Point ・ Resolution proof compression by splitting ・ Resolution proof reduction via local context rewriting ・ Resolution Rupes Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Resolution inference ： ウィキペディア英語版 Resolution inference In propositional logic, a resolution inference is an instance of the following rule:〔Fontaine, Pascal; Merz, Stephan; Woltzenlogel Paleo, Bruno. ''Compression of Propositional Resolution Proofs via Partial Regularization''. 23rd International Conference on Automated Deduction, 2011.〕 :$$ \frac\right\} }|\ell| We call: * The clauses $\backslash Gamma\_1\; \backslash cup\backslash left\backslash$ and $\backslash Gamma\_2\; \backslash cup\backslash left\backslash$ are the inference’s premises * $\backslash Gamma\_1\; \backslash cup\; \backslash Gamma\_2$ (the resolvent of the premises) is its conclusion. * The literal $\backslash ell$ is the left resolved literal, * The literal $\backslash overline$ is the right resolved literal, * $|\backslash ell|$ is the resolved atom or pivot. This rule can be generalized to first-order logic to:〔Enrique P. Arís, Juan L. González y Fernando M. Rubio, Lógica Computacional, Thomson, (2005).〕 :$$ \frac } \phi where $\backslash phi$ is a most general unifier of $L\_1$ and $\backslash overline$ and $\backslash Gamma\_1$ and $\backslash Gamma\_2$ have no common variables. == Example == The clauses $P(x),Q(x)$ and $\backslash neg\; P(b)$ can apply this rule with $()$ as unifier. Here x is a variable and b is a constant. :$$ \frac () Here we see that * The clauses $P(x),Q(x)$ and $\backslash neg\; P(x)$ are the inference’s premises * $Q(b)$ (the resolvent of the premises) is its conclusion. * The literal $P(x)$ is the left resolved literal, * The literal $\backslash neg\; P(b)$ is the right resolved literal, * $P$ is the resolved atom or pivot. * $()$ is the most general unifier of the resolved literals. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Resolution inference」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.